On the discrepancy of random low degree set systems

Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are $n$ elements and $m$ sets and each element lies in $t$ randomly chosen sets. In this setting, Ezra and Lovett showed an $O((t \log t)^{1/2})$ discrepancy bound in the regime when $n \leq m$ and an $O(1)$ bound when $n \gg m^t$. In this paper, we give a tight $O(\sqrt{t})$ bound for the entire range of $n$ and $m$, under a mild assumption that $t = \Omega (\log \log m)^2$. The result is based on two steps. First, applying the partial coloring method to the case when $n = m \log^{O(1)} m$ and using the properties of the random set system we show that the overall discrepancy incurred is at most $O(\sqrt{t})$. Second, we reduce the general case to that of $n \leq m \log^{O(1)}m$ using LP duality and a careful counting argument

k-Trails: Recognition, Complexity, and Approximations

The notion of degree-constrained spanning hierarchies, also called k-trails, was recently introduced in the context of network routing problems. They describe graphs that are homomorphic images of connected graphs of degree at most k. First results highlight several interesting advantages of k-trails compared to previous routing approaches. However, so far, only little is known regarding computational aspects of k-trails. In this work we aim to fill this gap by presenting how k-trails can be analyzed using techniques from algorithmic matroid theory. Exploiting this connection, we resolve several open questions about k-trails. In particular, we show that one can recognize efficiently whether a graph is a k-trail. Furthermore, we show that deciding whether a graph contains a k-trail is NP-complete; however, every graph that contains a k-trail is a (k+1)-trail. Moreover, further leveraging the connection to matroids, we consider the problem of finding a minimum weight k-trail contained in a graph G. We show that one can efficiently find a (2k-1)-trail contained in G whose weight is no more than the cheapest k-trail contained in G, even when allowing negative weights. The above results settle several open questions raised by Molnar, Newman, and Sebo

Malignant peripheral nerve sheath tumor of the cervical vagus nerve in a neurofibromatosis type 1 patient - An unusual presentation

Malignant peripheral nerve sheath tumors (MPNST’S) of the head and neck comprise 2% to 6% of head and neck sarcomas. These tumors may arise as sporadic variants or in patients with neurofibromatosis (NF). Development of these MPNST’s is one of the serious complications of neurofibromatosis type 1(NF1). To our knowledge there are only two reported cases of MPNST’s arising in the cervical vagal nerve, occurring in NF1 patients. We present here an NF1 patient who developed an MPNST of the cervical vagus nerve and presented only with a cervical swelling and hoarseness

Undifferentiated Carcinoma of Larynx of Nasopharyngeal Type

Undifferentiated carcinoma of nasopharyngeal type arising in the larynx is unusual. This type of carcinoma-which occurs almost exclusively in nasopharynx-is very infrequent in the larynx (0.2%). Till date only 17 cases are reported in the medical literature. We present the clinical and histopathological findings along with the management of one additional case of undifferentiated carcinoma of nasopharyngeal type in the larynx which was managed successfully with radiotherapy

Insular Carcinoma of Thyroid Presenting as a Giant Skull Lesion: A Dilemma in Treatment.

Thyroid surgeons are becoming increasingly more aware of a histologically distinct subset of thyroid carcinoma whose classification falls between well-differentiated and anaplastic carcinomas with respect to both cell differentiation and clinical behavior. This subtype of tumors has been categorized as poorly differentiated or insular carcinoma, based on its characteristic cell groupings. Although the differentiation of insular carcinoma from other thyroid carcinomas has important prognostic and therapeutic significance, relatively little about insular carcinoma has been published in the otolaryngology literature. In this article, we discuss a case of insular carcinoma of thyroid presenting with concurrent distant metastasis to skull, lung, ribs, and inguinal region with review of the literature. We conclude that insular thyroid carcinoma warrants aggressive management with total thyroidectomy and excision of accessible giant lesion followed by radioactive iodine ablation of any remaining thyroid tissue

Rational Pessimism, Rational Exuberance, and Asset Pricing Models

The paper estimates and examines the empirical plausibiltiy of asset pricing models that attempt to explain features of financial markets such as the size of the equity premium and the volatility of the stock market. In one model, the long run risks model of Bansal and Yaron (2004), low frequency movements and time varying uncertainty in aggregate consumption growth are the key channels for understanding asset prices. In another, as typified by Campbell and Cochrane (1999), habit formation, which generates time-varying risk-aversion and consequently time-variation in risk-premia, is the key channel. These models are fitted to data using simulation estimators. Both models are found to fit the data equally well at conventional significance levels, and they can track quite closely a new measure of realized annual volatility. Further scrutiny using a rich array of diagnostics suggests that the long run risk model is preferred.

Turning cross-cultural medical education on its head: Learning about ourselves and developing respectful curiosity

Cross-cultural education is often understood to mean acquiring cultural knowledge about different cultural groups in order to serve people from diverse groups equitably. However, this article argues that to work effectively in cross-cultural situations, we need to learn about our own culture and develop an approach of respectful curiosity. The first goal of cross-cultural education is to understand how culture influences our thoughts, perceptions, biases, and values at an unconscious level. The second goal is to understand the nature of individual cultural identity as a multidimensional and dynamic construct through exploration of our own cultural identity. This exploration helps us understand the limitations of learning about ‘others’ through learning categorical information and helps us limit the effect of our implicit biases on our interactions. The approach of respectful curiosity is recommended to question our assumptions, understand each unique individual patient, connect with each patient, and build the therapeutic relationship

Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension

Algorithmic mechanism design (AMD) studies the delicate interplay between computational efficiency, truthfulness, and optimality. We focus on AMD's paradigmatic problem: combinatorial auctions. We present a new generalization of the VC dimension to multivalued collections of functions, which encompasses the classical VC dimension, Natarajan dimension, and Steele dimension. We present a corresponding generalization of the Sauer-Shelah Lemma and harness this VC machinery to establish inapproximability results for deterministic truthful mechanisms. Our results essentially unify all inapproximability results for deterministic truthful mechanisms for combinatorial auctions to date and establish new separation gaps between truthful and non-truthful algorithms

On the number of matroids

We consider the problem of determining $m_n$, the number of matroids on $n$ elements. The best known lower bound on $m_n$ is due to Knuth (1974) who showed that $\log \log m_n$ is at least $n-3/2\log n-1$. On the other hand, Piff (1973) showed that $\log\log m_n\leq n-\log n+\log\log n +O(1)$, and it has been conjectured since that the right answer is perhaps closer to Knuth's bound. We show that this is indeed the case, and prove an upper bound on $\log\log m_n$ that is within an additive $1+o(1)$ term of Knuth's lower bound. Our proof is based on using some structural properties of non-bases in a matroid together with some properties of independent sets in the Johnson graph to give a compressed representation of matroids.Comment: Final version, 17 page

A New Simulation Metric to Determine Safe Environments and Controllers for Systems with Unknown Dynamics

We consider the problem of extracting safe environments and controllers for reach-avoid objectives for systems with known state and control spaces, but unknown dynamics. In a given environment, a common approach is to synthesize a controller from an abstraction or a model of the system (potentially learned from data). However, in many situations, the relationship between the dynamics of the model and the \textit{actual system} is not known; and hence it is difficult to provide safety guarantees for the system. In such cases, the Standard Simulation Metric (SSM), defined as the worst-case norm distance between the model and the system output trajectories, can be used to modify a reach-avoid specification for the system into a more stringent specification for the abstraction. Nevertheless, the obtained distance, and hence the modified specification, can be quite conservative. This limits the set of environments for which a safe controller can be obtained. We propose SPEC, a specification-centric simulation metric, which overcomes these limitations by computing the distance using only the trajectories that violate the specification for the system. We show that modifying a reach-avoid specification with SPEC allows us to synthesize a safe controller for a larger set of environments compared to SSM. We also propose a probabilistic method to compute SPEC for a general class of systems. Case studies using simulators for quadrotors and autonomous cars illustrate the advantages of the proposed metric for determining safe environment sets and controllers.Comment: 22nd ACM International Conference on Hybrid Systems: Computation and Control (2019